Scavenger 0.1: A Theorem Prover Based on Conflict Resolution
نویسندگان
چکیده
This paper introduces Scavenger, the first theorem prover for pure first-order logic without equality based on the new conflict resolution calculus. Conflict resolution has a restricted resolution inference rule that resembles (a first-order generalization of) unit propagation as well as a rule for assuming decision literals and a rule for deriving new clauses by (a first-order generalization of) conflict-driven clause learning.
منابع مشابه
Formal Verification of Safety Buffers for State-based Conflict Detection and Resolution
There are always errors when measuring position and velocity of moving objects such as aircraft. Therefore, the information provided by global positioning systems is never totally exact. This paper studies the effects of these errors in the actual separation of aircraft in the context of statebased conflict detection and resolution. Assuming that the state information is uncertain but that boun...
متن کاملSystem Description: Leo – A Resolution based Higher-Order Theorem Prover
We present Leo, a resolution based theorem prover for classical higher-order logic. It can be employed as both an fully automated theorem prover and an interactive theorem prover. Leo has been implemented as part of the Ωmega environment [23] and has been integrated with the Ωmega proof assistant. Higher-order resolution proofs developed with Leo can be displayed and communicated to the user vi...
متن کاملA Self-Modifying Theorem Prover
Theorem provers can be viewed as containing declarative knowledge (in the form of axioms and lemmas) and procedural knowledge (in the form of an algorithm for proving theorems). Sometimes, as in the case of commutative laws in a Knuth-Bendix prover, it is appropriate or necessary to transfer knowledge from one category to the other. We describe a theorem proving system that independently recogn...
متن کاملStrong and weak points of the MUSCADET theorem prover - examples from CASC-JC
MUSCADET is a knowledge-based theorem prover based on natural deduction. It has participated in CADE Automated theorem proving System Competitions. The results show its complementarity with regard to resolution-based provers. This paper presents some of its crucial methods and gives some examples of MUSCADET proofs from the last competition (CASC-JC in IJCAR 2001).
متن کاملA Theorem-Prover for a Decidable Subset of Default Logic
II DEFAULT LOGIC Non-monotonic logic is an attempt to take into account such notions as incomplete knowledge and theory evolution. However the decidable theorem-prover issue has been so far unexplored. We propose such a theorem-prover for default logic with a restriction on the first-order formulae it deals with. This theorem-prover is based on the generalisation of a resolution technique named...
متن کامل